An Algorithm for Multiplication Modulo (2^N-1)
نویسنده
چکیده
This paper propose an efficient algorithm for multipliers modulo . To achieve high speed, the Wallace tree is adopted for the multipliers. The proposed Wallace tree multipliers exhibit much more resular structure than binary Wallace tree cultipliers. Comparison with a previous counterpart shows favorable to our multiplier in both speed and hardware..
منابع مشابه
VLSI Research Group University of Windsor
Modulo multiplication plays an important role in the Fermat number transform and residue number systems; the diminished-1 representation of numbers has been found most suitable for representing the elements of the rings. Existing algorithms for modulo multiplication either use recursive modulo addition, or a regular binary multiplication integrated with the modulo reduction operation. Although ...
متن کاملAn Implementation of Schh Onhage's Multiplication Algorithm (or How to Compute the Square of a Number with One Million Digits on Your Workstation in Less than One Minute)
This report describes an implementation of a fast multiplication algorithm proposed by A. Sch onhage [5]. The algorithm performs the multiplication of two integers modulo a number of the form 2 N + 1 in O(N logN log logN) operations. Using the BigNum package [2], we wrote a C program of less than 350 lines that performs both the modular and integer multiplication. We give detailed timings and ...
متن کاملDiminished-One Modulo (2 + 1) Multiplier Design
A technique, based on the residue number system (RNS) with operands in the diminished-1 number system, has been used in several applications which include digital signal processing (DSP), implementation international data encryption algorithm (IDEA), Fermat number transform (FNT), and so on. For implementation of these techniques, several designs for modulo 2+1 diminished-1 arithmetic blocks ha...
متن کاملHyperdense Coding Modulo 6 with Filter-Machines
We show how one can encode n bits with n “wave-bits” using still hypothetical filter-machines (here o(1) denotes a positive quantity which goes to 0 as n goes to infity). Our present result in a completely different computational model significantly improves on the quantum superdense-coding breakthrough of Bennet and Wiesner (1992) which encoded n bits by ⌈n/2⌉ quantumbits. We also show that ou...
متن کاملA Fast Algorithm for Computing Binomial Coefficients Modulo Powers of Two
I present a new algorithm for computing binomial coefficients modulo 2N. The proposed method has an O(N3·Multiplication(N)+N4) preprocessing time, after which a binomial coefficient C(P, Q) with 0≤Q≤P≤2N-1 can be computed modulo 2N in O(N2·log(N)·Multiplication(N)) time. Multiplication(N) denotes the time complexity of multiplying two N-bit numbers, which can range from O(N2) to O(N·log(N)·log(...
متن کامل